Introduzione all’opera di Jacqueline Bishop

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introduzione Alla Crittografia

Sommario Obiettivi • Comprendere cosa si intende per crittografia; • Illustrare le principali tecniche di crittografia; • Capire come sono applicate le tecniche di codifica e decodifica.

متن کامل

Introduzione all'Intelligenza Artificiale

L’articolo presenta un’introduzione all’Intelligenza Artificiale (IA) in forma divulgativa e informale ma precisa. L’articolo affronta prevalentemente gli aspetti informatici della disciplina, presentando varie tecniche usate nei sistemi di IA e dividendole in simboliche e subsimboliche. L’articolo si conclude presentando il dibattito in corso sull’IA e in particolare sui vantaggi e i pericoli ...

متن کامل

A Bishop surface with a vanishing Bishop invariant

We derive a complete set of invariants for a formal Bishop surface near a point of complex tangent with a vanishing Bishop invariant under the action of formal transformations. We prove that the modular space of Bishop surfaces with a vanishing Bishop invariant and with a fixed Moser invariant s < ∞ is of infinite dimension. We also prove that the equivalence class of the germ of a generic real...

متن کامل

The Mergelyan-Bishop Theorem

We define the differential operator ∂ ∂z on infinitely differentiable functions (also called smooth or C∞ functions) on some open set in C by ∂ ∂z = 1 2 ( ∂ ∂x + i ∂ ∂y ). A quick calculation shows that ∂ ∂z obeys the product rule. Recall that a function f is holomorphic if and only if ∂ ∂z (f) = 0. A function is biholomorphic, or an analytic isomorphism, if it is holomorphic and has holomorphi...

متن کامل

Genetic Local Search for Job Shop Scheduling Problem Table of Contents Part I – Introduzione 1 Introduzione 2

Job Shop Scheduling Problem is a strongly NP-hard problem of combinatorial optimisation and one of the most well-known machine scheduling problem. Taboo Search is an effective local search algorithm for the job shop scheduling problem, but the quality of the best solution found depends on the initial solution used. To overcome this problem in this thesis we present a new approach that uses a po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Il Tolomeo

سال: 2018

ISSN: 1594-1930,2499-5975

DOI: 10.30687/tol/2499-5975/2018/20/007